Monte Carlo Localization with Mixture Proposal Distribution
نویسندگان
چکیده
Monte Carlo localization (MCL) is a Bayesian algorithm for mobile robot localization based on particle filters, which has enjoyed great practical success. This paper points out a limitation of MCL which is counter-intuitive, namely that better sensors can yield worse results. An analysis of this problem leads to the formulation of a new proposal distribution for the Monte Carlo sampling step. Extensive experimental results with physical robots suggest that the new algorithm is significantly more robust and accurate than plain MCL. Obviously, these results transcend beyond mobile robot localization and apply to a range of particle filter applications.
منابع مشابه
Adaptive Incremental Mixture Markov chain Monte Carlo
We propose Adaptive Incremental Mixture Markov chain Monte Carlo (AIMM), a novel approach to sample from challenging probability distributions defined on a general state-space. Typically, adaptive MCMC methods recursively update a parametric proposal kernel with a global rule; by contrast AIMM locally adapts a non-parametric kernel. AIMM is based on an independent Metropolis-Hastings proposal d...
متن کاملMonte Carlo Sampling of Non-Gaussian Proposal Distribution in Feature-Based RBPF-SLAM
Particle filters are widely used in mobile robot localization and mapping. It is well-known that choosing an appropriate proposal distribution plays a crucial role in the success of particle filters. The proposal distribution conditioned on the most recent observation, known as the optimal proposal distribution (OPD), increases the number of effective particles and limits the degeneracy of filt...
متن کاملsMCL: Monte-Carlo Localization for Mobile Robots with Stereo Vision
This paper presents Monte-Carlo localization (MCL) [1] with a mixture proposal distribution for mobile robots with stereo vision. We combine filtering with the Scale Invariant Feature Transform (SIFT) image descriptor to accurately and efficiently estimate the robot’s location given a map of 3D point landmarks. Our approach completely decouples the motion model from the robot’s mechanics and is...
متن کاملLocalization with Improved Proposals
Solving localization and navigation tasks reliably is an essential objective for autonomous mobile systems and robots. A popular technique for estimating the robot’s pose is localization with particle filters, also known as Monte–Carlo localization (MCL). In this paper we present a MCL–based localization system that employs informed proposal distributions to sample particles during the motion s...
متن کاملLayered Adaptive Importance Sampling
Monte Carlo methods represent the de facto standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use simpler proposal probability densities for drawing candidate samples. Performance of any such method is strictly related to the specification of the proposal ...
متن کامل